lot sizing with rework and different inspection costs

Authors

rasoul haji

alireza haji

abstract

this paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. we have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. further, we have assumed that defective items will be reworked and the inspection costs during the normal production and rework proc-essing times are different. for this system we obtained the optimal batch sizes for each product such that the total cost per unit time is minimized.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Lot sizing with rework and different inspection costs

This paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. We have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. Further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

full text

Integrating Quality and Inspection for the Optimal Lot-sizing Problem with Rework, Minimal Repair and Inspection Time

This research is derived an integrated model of economic production quantity, inspection and preventive maintenance to incorporate rework, minimal repair and inspection time for an imperfect production system. Some proportions of non-conforming items are assumed scrap before the rework process start and others are reworked. The rework process is imperfect that is a proportion of the reworked it...

full text

Lot Sizing with Piecewise Concave Production Costs

We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming (DP) algorithm to solve this problem and answer an open question in the literature: we s...

full text

Online lot-sizing problems with ordering, holding and shortage costs

We study inventorymanagement problemswhere demands are revealed incrementally and procurement decisionsmust bemade before the demands are realized. There are no probabilistic distributions nor nontrivial bounds to characterize demands. We consider two cost minimization problems: (1) perishable products with lost sales and (2) durable products with backlogged demand. In both problems, costs are ...

full text

Multi-item lot-sizing with joint set-up costs

We consider a multi-item lot-sizing problem with joint set-up costs and constant capacities. Apart from the usual per unit production and storage costs for each item, a set-up cost is incurred for each batch of production, where a batch consists of up toC units of anymix of the items. In addition, an upper bound on the number of batches may be imposed. Under widely applicable conditions on the ...

full text

My Resources

Save resource for easier access later


Journal title:
journal of industrial engineering, international

ISSN 1735-5702

volume 2

issue 3 2006

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023